Boolean logics with relations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of Boolean Topological Logics Short Form: Boolean Topological Logics

We investigate logics that are derived from topological spaces; such logics were first described by Westmoreland and Schumacher in 1993. Here, we explore the relationship between the logic systems and the topologies used to construct them. Special attention is given to Boolean topological logics. We show a characterization of these

متن کامل

Graph Logics with Rational Relations

We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages and relations, but they often need to be extended by rational relations such as subword or subse...

متن کامل

Multiple Boolean Relations

Flexibility in selecting the Boolean functions to implement a digital circuit has various forms which have been studied in the literature such as don't care conditions, Boolean relations, and synchronous recurrence equations. Each of these represents a particular degree of exibility that may be given in the description, inherent in the current representation, or derived from the surrounding env...

متن کامل

Rough Relations and Logics

In this chapter we discuss properties and applications of rough relations. We also investigate two types of logics in which one can express and prove properties of rough relations.

متن کامل

Constant Domain QuantifiedModal Logics Without Boolean Negation

: This paper provides a sound and complete axiomatisation for constant domain modal logics without Boolean negation. This is a simpler case of the difficult problem of providing a sound and complete axiomatisation for constant-domain quantified relevant logics, which can be seen as a kind of modal logic with a twoplace modal operator, the relevant conditional. The completeness proof is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Logic and Algebraic Programming

سال: 2010

ISSN: 1567-8326

DOI: 10.1016/j.jlap.2010.07.012